Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
نویسندگان
چکیده
منابع مشابه
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Π of the symmetric group S3. An instance of such a problem consists of a set of variables V and a set of constraints C, where each constraint is an ordered triple of distinct elements from V . The goal is to construct a linear order α on V such that, for each constraint (a, b, c) ∈ C, the ordering of a, b, c in...
متن کاملconstNJ: An Algorithm to Reconstruct Sets of Phylogenetic Trees Satisfying Pairwise Topological Constraints
This article introduces constNJ (constrained neighbor-joining), an algorithm for phylogenetic reconstruction of sets of trees with constrained pairwise rooted subtree-prune-regraft (rSPR) distance. We are motivated by the problem of constructing sets of trees that must fit into a recombination, hybridization, or similar network. Rather than first finding a set of trees that are optimal accordin...
متن کاملTrees, Linear Orders and Gâteaux Smooth Norms
We introduce a linearly ordered set Z and use it to prove a necessity condition for the existence of a Gâteaux smooth norm on C0(Υ), where Υ is a tree. This criterion is directly analogous to the corresponding equivalent condition for Fréchet smooth norms. In addition, we prove that if C0(Υ) admits a Gâteaux smooth lattice norm then it also admits a lattice norm with strictly convex dual norm.
متن کاملLinear Constraints over Infinite Trees
In this paper we consider linear arithmetic constraints over infinite trees whose nodes are labelled with nonnegative real numbers. These constraints arose in the context of resource inference for objectoriented programs but should be of independent interest. It is as yet open whether satisfiability of these constraint systems is at all decidable. For a restricted fragment motivated from the ap...
متن کاملThe k-assignment Polytope, Phylogenetic Trees, and Permutation Patterns
In this thesis three combinatorial problems are studied in four papers. In Paper 1 we study the structure of the k-assignment polytope, whose vertices are the m× n (0,1)-matrices with exactly k 1:s and at most one 1 in each row and each column. This is a natural generalisation of the Birkhoff polytope and many of the known properties of the Birkhoff polytope are generalised. A representation of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.06.021